1800D - Remove Two Letters - CodeForces Solution

#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#define forn(i, n)for(int i = 0; i < int(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const double dinf=1e300;
const ll INF=1e18;
const int Mod=1e9+7;
const int maxn=5e5+10;
const ll N = 1'000'000'000'000L;
const int MaX = 1e3 + 11;
unordered_set<ll> cubes;
void Ahmos()
{
    cin.tie(NULL);
    cout.tie(NULL);
    ios_base::sync_with_stdio(false);
}
void Ahmos2()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

bool isPrime(long long n)
{

    if(n<=1)
        return false;
    for(long long i=2; i<=sqrt(n); i++)
    {
        if(n%i==0)
            return false;
    }

    return true;

}
ll fact(ll a)
{
    ll sum=1;
    for(int i=1; i<=a; i++)
    {
        sum*=i;
    }
    return sum;
}

void so1()
{
    int n;cin>>n;
    string s;cin>>s;
    long long c=1;
    for(int i=2;i<n;i++)
    {
        if(s[i]==s[i-2])continue;
        c++;
    }
    cout<<c<<endl;

}
int main()
{
    Ahmos();
    int t=1;
    cin>>t;
    while(t--)
        so1();








}